Hexagonal and Pruned Torus Networks as Cayley Graphs
نویسندگان
چکیده
Hexagonal mesh and torus, as well as honeycomb and certain other pruned torus networks, are known to belong to the class of Cayley graphs which are node-symmetric and possess other interesting mathematical properties. In this paper, we use Cayley-graph formulations for the aforementioned networks, along with some of our previous results on subgraphs and coset graphs, to draw conclusions relating to internode distance and network diameter. We also use our results to refine, clarify, and unify a number of previously published properties for these networks and other networks derived from them. Keywords– Cayley digraph, Coset graph, Diameter, Distributed system, Hex mesh, Homomorphism, Honeycomb mesh or torus, Internode distance.
منابع مشابه
Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks
Despite numerous interconnection schemes proposed for distributed multicomputing, systematic studies of classes of interprocessor networks, that offer speed-cost tradeoffs over a wide range, have been few and far in between. A notable exception is the study of Cayley graphs that model a wide array of symmetric networks of theoretical and practical interest. Properties established for all, or fo...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملResistance distances and the Kirchhoff index in Cayley graphs
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t In this paper, closed-form formulae for the Kirchhoff index and resistance distances of the Cayley graphs ov...
متن کاملInfinitely many one-regular Cayley graphs on dihedral groups of any prescribed valency
A graph is one-regular if its automorphism group acts regularly on the arc set. In this paper, we construct a new infinite family of one-regular Cayley graphs of any prescribed valency. In fact, for any two positive integers , k 2 except for ( , k) ∈ {(2,3), (2,4)}, the Cayley graph Cay(Dn,S) on dihedral groups Dn = 〈a, b | an = b2 = (ab)2 = 1〉 with S = {a1+ +···+ t b | 0 t k − 1} and n = ∑k−1 ...
متن کاملFurther Properties of Cayley Digraphs and Their Applications to Interconnection Networks
In this short communication, we extend the known relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups and obtain some general results on homomorphism and distance between them. Intuitively, our results correspond to synthesizing alternative, more economical, interconnection networks by reducing the number of dimensions and/or link density of exist...
متن کامل